Dividing and Conquering
نویسنده
چکیده
We suggest that the components of the well known divide-and-conquer paradigm can be prootably presented as independent constructs in a skeletal parallel programming model. We investigate this proposal in the context of a rendition of Batcher's bitonic sorting algorithm in which the nested parallel structure of the program is neatly abstracted from the low level detail of a at presentation. We show that a variant of the conquer construct can make the presentation neater still, and discuss the implications for the design of skeletal models.
منابع مشابه
Dividing and Conquering Long Sentences in a Translation System
The time required for our translation system to handle a sentence of length I is a rapidly growing function of i. We describe here a method for analyzing a sentence into a series of pieces that can be translated sequentially. We show that for sentences with ten or fewer words, it is possible to decrease the translation time by 40% with almost no effect on translation accuracy. We argue that for...
متن کاملA Vertex Separator-based Algorithm for Hypergraph Bipartitioning
Hypergraph partitioning is critical for dividing and conquering intractable problems in many complex systems, which is an NP-hard problem. In the paper, a novel hypergraph bipartitioning algorithm is proposed, which partitions the hypergraph by separating the intersection graph. The new approach completely eliminates the adverse effects of hyperedges with large cardinality on the performance of...
متن کاملThe Position of Tribe and Urban Structure in Social Compatibility of Sham and Iraq in Umayyad Era
The Arabic-Islamic Umayyad state, as the first Islamic dynasty, managed to have the monopoly of tribal discourse in Islamic world in 40 AH through conquering the already dominant religious theocracy discourse. Umayyad caliphs succeeded in conquering the occidental world to Andalusia and the oriental world to middle Asia by the help of creating a sort of social solidarity. These conquests took p...
متن کاملScaling up instance selection algorithms by dividing-and-conquering
The overwhelming amount of data that is available nowadays in any field of research poses new problems for machine learning methods. This huge amount of data makes most of the existing algorithms inapplicable to many real-world problems. Two approaches have been used to deal with this problem: scaling up machine learning algorithms and data reduction. Nevertheless, scaling up a certain algorith...
متن کاملA Hierarchical Approach to Persistent Scatterer Network Construction and Deformation Time Series Estimation
This paper presents a hierarchical approach to network construction and time series estimation in persistent scatterer interferometry (PSI) for deformation analysis using the time series of high-resolution satellite SAR images. To balance between computational efficiency and solution accuracy, a dividing and conquering algorithm (i.e., two levels of PS networking and solution) is proposed for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997